Optimistic Causal Consistency for Geo-Replicated Key-Value Stores
نویسندگان
چکیده
Causal consistency (CC) is an attractive model for geo-replicated data stores because it hits a sweet spot in the ease-of-programming versus performance trade-off. We present new approach implementing CC stores, which we call Optimistic Consistency (OCC). OCC's main design goal to maximize freshness. The optimism our lies fact that updates replicated remote center are made visible immediately, without checking if their causal dependencies have been received. Servers perform dependency check needed enforce only upon serving client operation, rather than on receipt of item as existing systems. OCC offers significant gain freshness, crucial importance various types applications, such real-time potentially blocking behavior makes vulnerable network partitions. therefore propose recovery mechanism allows system fall back pessimistic protocol continue operating during implement POCC, first causally consistent multi-master key-value store designed show POCC improves while offering comparable or better its counterparts.
منابع مشابه
Toward Adaptive Causal Consistency for Replicated Data Stores
Causal consistency for key-value stores has two main requirements (1) do not make a version visible if some of its dependencies are invisible as it may violate causal consistency in the future and (2) make a version visible as soon as possible so that clients have the most recent information (to the extent feasible). These two requirements conflict with each other. Existing key-value stores tha...
متن کاملQuantitative Analysis of Consistency in NoSQL Key-Value Stores
The promise of high scalability and availability has prompted many companies to replace traditional relational database management systems (RDBMS) with NoSQL key-value stores. This comes at the cost of relaxed consistency guarantees: key-value stores only guarantee eventual consistency in principle. In practice, however, many key-value stores seem to offer stronger consistency. Quantifying how ...
متن کاملSpeculative Transaction Processing in Geo-Replicated Data Stores
This work presents STR, a geo-distributed, partially replicated transactional data store, which leverages on novel speculative techniques to mask the inter-replica synchronization latency. The theoretical foundations on top of which we built STR is a novel consistency criterion, which we call SPeculative Snapshot Isolation (SPSI). SPSI extends the well-known Snapshot Isolation semantics in an i...
متن کاملTransactions with Consistency Choices on Geo-Replicated Cloud Storage
Pileus is a replicated and scalable key-value storage system that features geo-replicated transactions with varying degrees of consistency chosen by applications. Each transaction reads from a snapshot selected based on its requested consistency, from strong to eventual consistency or intermediate guarantees such as read-my-writes, monotonic, bounded, and causal.
متن کاملLoad balancing for Key Value Data Stores
In the last decade new scalable data stores have emerged in order to process and store the increasing amount of data that is produced every day. These data stores are inherently distributed to adapt to the increasing load and generated data. HBase is one of such data stores built after Google BigTable that stores large tables (hundreds of millions of rows) where data is stored sorted by key. A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2021
ISSN: ['1045-9219', '1558-2183', '2161-9883']
DOI: https://doi.org/10.1109/tpds.2020.3026778